Final Semantics for Decorated Traces

Final Semantics for Decorated Traces

In concurrency theory, various semantic equivalences on labelled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors [13], we give a c...

Traces Semantics for Actor Systems

The theory of traces is used to describe the behavior of actor systems. The semantics is built from two simple concepts: a set of events representing the reception of messages by objects, and a binary symmetric and irreeexive relation on events|independence|representing permissible concurrency. Causality, the dual notion of concurrency, is expressed by the dependence relation|the complement of ...

A coalgebraic view on decorated traces

F. Bonchi, M. Bonsangue, 2,3 G. Caltais, 3,4 J. Rutten, 3,5 A. Silva, 3,5,6 1 ENS Lyon, Université de Lyon, LIP (UMR 5668 CNRS ENS Lyon UCBL INRIA) 2 LIACS Leiden University, The Netherlands 3 Centrum voor Wiskunde en Informatica, The Netherlands 4 School of Computer Science Reykjavik University, Iceland 5 Radboud University Nijmegen, The Netherlands 6 HASLab / INESC TEC, Universidade do Minho,...

On Symbolic Semantics for Name-decorated Contexts

Final semantics for the - calculus

In this paper we discuss nal semantics for the-calculus, a process algebra which models systems that can dynamically change the topology of the channels. We show that the nal semantics paradigm, originated by Aczel and Rutten for CCS-like languages, can be successfully applied also here. This is achieved by suitably generalizing the standard techniques so as to accommodate the mechanism of name...